On the formulation of closest-point projection algorithms in elastoplasticity-part II: Globally convergent schemes
نویسندگان
چکیده
منابع مشابه
On the Formulation of Closest-Point Projection Algorithms in Elastoplasticity. Part II: Globally Convergent Schemes
This paper presents the formulation of numerical algorithms for the solution of the closest-point projection equations that appear in typical implementations of return mapping algorithms in elastoplasticity. The main motivation behind this work is to avoid the poor global convergence properties of a straight application of a Newton scheme in the solution of these equations, the socalled Newton–...
متن کاملOn the Formulation of Closest-Point Projection Algorithms in Elastoplasticity
We present in this paper the characterization of the variational structure behind the discrete equations defining the closest-point projection approximation in elastoplasticity. Rate-independent and viscoplastic formulations are considered in the infinitesimal and the finite deformation range, the later in the context of isotropic finite strain multiplicative plasticity. Primal variational prin...
متن کاملGlobally convergent algorithms with local learning rates
A novel generalized theoretical result is presented that underpins the development of globally convergent first-order batch training algorithms which employ local learning rates. This result allows us to equip algorithms of this class with a strategy for adapting the overall direction of search to a descent one. In this way, a decrease of the batch-error measure at each training iteration is en...
متن کاملthe impact of e-readiness on ec success in public sector in iran the impact of e-readiness on ec success in public sector in iran
acknowledge the importance of e-commerce to their countries and to survival of their businesses and in creating and encouraging an atmosphere for the wide adoption and success of e-commerce in the long term. the investment for implementing e-commerce in the public sector is one of the areas which is focused in government‘s action plan for cross-disciplinary it development and e-readiness in go...
Globally Convergent Newton Algorithms for Blind Decorrelation
This paper presents novel Newton algorithms for the blind adaptive decorrelation of real and complex processes. They are globally convergent and exhibit an interesting relationship with the natural gradient algorithm for blind decorrelation and the Goodall learning rule. Indeed, we show that these two later algorithms can be obtained from their Newton decorrelation versions when an exact matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2001
ISSN: 0029-5981
DOI: 10.1002/nme.279